Traces, dependency graphs and DNLC grammars

Dependency Graphs Embedding Confluent Graph Grammars

Abstract: Graph grammars have been developed as an extension of the formal grammars on strings to grammars on graphs, and provide a mechanism in which transformations on graphs can be modeled in a mathematically precise way. In this paper, based on confluent graph grammars, the authors present a novel representation for data-flow graphs, control-flow graphs, combined control-data-graphs, bipart...

On the membership problem for regular DNLC grammars

Dependency Grammars and Context-Free Grammars

The question arises from time to time what the relation is between dependency grammars (DG’s) and phrase-structure grammars. A classic paper by Gaifman [1] would appear to have laid the issue to rest, by proving that dependency grammars are a special case of context-free grammars (CFG’s). Gaifman proves that dependency grammars are equivalent to a proper subset of phrasestructure grammars, thos...

Categorial dependency grammars

Categorial Dependency Grammars (CDG) introduced in this paper express projective and distant dependencies in classical categorial grammar terms. They treat order constraints in terms of oriented polarized valencies and a bounded commutativity rule. CDGs are expressive, constitute a convenient frame for coupling dependency grammars with linguistic semantics, and with all this, they are parsed in...

Generalized Categorial Dependency Grammars

Generalized Categorial Dependency Grammars (gCDG) studied in this paper are genuine categorial grammars expressing projective and discontinuous dependencies, stronger than CF-grammars and nonequivalent to mild context-sensitive grammars. We show that gCDG are parsed in polynomial time and enjoy good mathematical properties.